4-regular partitions and the pod function
نویسندگان
چکیده
The function pod(n) enumerates the partitions of n wherein odd parts are distinct and even unrestricted. Recently, a number properties for have been established. In this paper, we use connections with 4-regular and, fixed k ∈ {0, 2}, into not congruent to modulo 4 in order obtain new pod(n). context, derive two infinite families linear inequalities involving We also identities Watson type.
منابع مشابه
Classifying ω-Regular Partitions
We try to develop a theory of ω-regular partitions in parallel with the theory around the Wagner hierarchy of regular ω-languages. In particular, we generalize a theorem of L. Staiger and K. Wagner to the case of partitions, prove decidability of all levels of the Boolean hierarchy of regular partitions over open sets, establish coincidence of reducibilities by continuous functions and by funct...
متن کاملRegular coding partitions
The canonical coding partition of a set of words is the finest partition such that the words contained in at least two factorizations of a same sequence belong to a same class. In the case the set is not uniquely decipherable, it partitions the set into one unambiguous class and other parts that localize the ambiguities in the factorizations of finite sequences. We prove that the canonical codi...
متن کاملInternal Partitions of Regular Graphs
An internal partition of an n-vertex graph G = (V,E ) is a partition of V such that every vertex has at least as many neighbors in its own part as in the other part. It has been conjectured that every d -regular graph with n > N(d ) vertices has an internal partition. Here we prove this for d = 6. The case d = n − 4 is of particular interest and leads to interesting new open problems on cubic g...
متن کاملCoding Partitions of Regular Sets
A coding partition of a set of words partitions this set into classes such that whenever a sequence, of minimal length, has two distinct factorizations, the words of these factorizations belong to the same class. The canonical coding partition is the finest coding partition that partitions the set of words in at most one unambiguous class and other classes that localize the ambiguities in the f...
متن کاملRegular partitions of hypergraphs and property testing
About 30 years ago Szemerédi developed the regularity method for graphs, which was a key ingredient in the proof of his famous density result concerning the upper density of subsets of the integers which contain no arithmetic progression of fixed length. Roughly speaking, the regularity lemma asserts, that the vertex set of every graph can be partitioned into a constant number of classes such t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quaestiones Mathematicae
سال: 2023
ISSN: ['1727-933X', '1607-3606']
DOI: https://doi.org/10.2989/16073606.2022.2144530